Num Bktrk/ Cost/constraint Exec Example Btk ($) Time (s) Table 4. Hierarchical Behavioral Partition- Ing and Package Design

نویسندگان

  • Nand Kumar
  • Srinivas Katkoori
  • Leo Rader
چکیده

explores the design space by considering alternate implementations during high level synthesis. Also, thermal prooling of rtl designs is too time consuming and is not viable for large designs. For almost all the examples, MSS produces better results and executes much faster than the hierarchical rtl partitioning. For smaller designs, scheduling overhead can be reduced through approximate estimation procedures to evaluate the cost of level 1 segments form individual process costs. From the results, we infer that the hierarchical behavioral partitioning is both a suitable and a viable approach to multicomponent synthesis and hierarchical packaging.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Multi-objective Hierarchical Location-allocation Model for the Healthcare Network Design Considering a Referral System

This paper presents a multi-objective and multi-service location-allocation model with capacity planning to design a healthcare facilities network through considering a referral system. Therefore, a mixed integer nonlinear programming (MINLP) model containing two objective functions is proposed. The first objective function is  relates to minimization of total opening cost, minimization of tota...

متن کامل

Bi-objective Economic statistical design of the joint Xbar and S charts incorporating Taguchi loss function

In this research, we propose a bi-objective model for the economic-statistical design of the X-bar and S control charts. The model minimizes out-of-control average time to signal as well as minimizing mean hourly loss-cost where it incorporates the Taguchi loss function. Statistical constraint is considered in the model to achieve desired in-control time to signal. A non-dominated sort...

متن کامل

A Robust Adaptive Observer-Based Time Varying Fault Estimation

This paper presents a new observer design methodology for a time varying actuator fault estimation. A new linear matrix inequality (LMI) design algorithm is developed to tackle the limitations (e.g. equality constraint and robustness problems) of the well known so called fast adaptive fault estimation observer (FAFE). The FAFE is capable of estimating a wide range of time-varying actuator fault...

متن کامل

Improved Approximation Algorithms for Balanced Partitioning Problems

We present approximation algorithms for balanced partitioning problems. These problems are notoriously hard and we present new bicriteria approximation algorithms, that approximate the optimal cost and relax the balance constraint. In the first scenario, we consider Min-Max k-Partitioning, the problem of dividing a graph into k equal-sized parts while minimizing the maximum cost of edges cut by...

متن کامل

A Technique for Dynamic High-Level Exploration During Behavioral-Partitioning for Multi-Device Architectures

This paper presents a novel technique to perform dynamic high-level exploration of a behavioral specification that is being partitioned for a multi-device architecture. The technique, unlike in traditional HLS, performs a global search on the four-dimensional design space formed by multiple partition segments of the behavior. Hence, the proposed technique effectively satisfies the global latenc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996